Minding Machines: A Note on Alienation

A Note on Kolmogorov-Uspensky Machines

Solving an open problem stated by Shvachko, it is shown that a language which is not real-time recognizable by some variants of pointer machines can be accepted by a Kolmogorov-Uspensky machine in realtime.

A note on accelerated Turing machines

In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in accelerated mode. We also propose two ways to define the language accepted by an accelerated Turing machine. Accordingly, the classes of languages accepted by accelerated Turing machines are the closure under Boolean operations o...

A Historical Perspective on Parental Alienation Syndrome and Parental Alienation

A note on hierarchical scheduling on two uniform machines

This paper studies online hierarchical scheduling on two uniform machines with the objective to minimize makespan. Machines are provided with different capability, i.e., the one with speed s can schedule all jobs, while the other one with speed 1 can only process partial jobs. Optimal algorithms for any 0 < s <∞ are given in the paper. For 0 < s < 1, it has a competitive ratio of min{1 + s,1 + ...

A Note on Least Squares Support Vector Machines

In this paper, we propose some improvements for the implementations of least squares support vector machine classifiers (LS-SVM). An improved conjugate gradient scheme is proposed for solving the optimization problems in LS-SVM, and an improved SMO algorithm is put forward for the general unconstrained quadratic programming problems which is the case of LS-SVM without the bias term. Numerical e...